A Flow-aware MAC Protocol for a Passive Optical Metropolitan Area Network

The paper introduces an original MAC protocol for a passive optical metropolitan area network using time-domain wavelength interleaved networking (TWIN)% as proposed recently by Bell Labs . Optical channels are shared under the distributed control of destinations using a packet-based polling algorithm. This MAC is inspired more by EPON dynamic bandwidth allocation than the slotted, GPON-like access control generally envisaged for TWIN. Management of source-destination traffic streams is flow-aware with the size of allocated time slices being proportional to the number of active flows. This emulates a network-wide, distributed fair queuing scheduler, bringing the well-known implicit service differentiation and robustness advantages of this mechanism to the metro area network. The paper presents a comprehensive performance evaluation based on analytical modelling supported by simulations. The proposed MAC is shown to have excellent performance in terms of both traffic capacity and packet latency

Enhanced Cluster Computing Performance Through Proportional Fairness

The performance of cluster computing depends on how concurrent jobs share multiple data center resource types like CPU, RAM and disk storage. Recent research has discussed efficiency and fairness requirements and identified a number of desirable scheduling objectives including so-called dominant resource fairness (DRF). We argue here that proportional fairness (PF), long recognized as a desirable objective in sharing network bandwidth between ongoing flows, is preferable to DRF. The superiority of PF is manifest under the realistic modelling assumption that the population of jobs in progress is a stochastic process. In random traffic the strategy-proof property of DRF proves unimportant while PF is shown by analysis and simulation to offer a significantly better efficiency-fairness tradeoff.Comment: Submitted to Performance 201

Multi-resource fairness: Objectives, algorithms and performance

Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters shared by multi-task jobs and routers equipped with middleboxes shared by flows of different types. We show that the currently preferred objective of Dominant Resource Fairness has a significantly less favorable efficiency-fairness tradeoff than alternatives like Proportional Fairness and our proposal, Bottleneck Max Fairness. In addition to other desirable properties, these objectives are equally strategyproof in any realistic scenario with dynamic demand

Exploring the Memory-Bandwidth Tradeoff in an Information-Centric Network

An information-centric network should realize significant economies by exploiting a favourable memory-bandwidth tradeoff: it is cheaper to store copies of popular content close to users than to fetch them repeatedly over the Internet. We evaluate this tradeoff for some simple cache network structures under realistic assumptions concerning the size of the content catalogue and its popularity distribution. Derived cost formulas reveal the relative impact of various cost, traffic and capacity parameters, allowing an appraisal of possible future network architectures. Our results suggest it probably makes more sense to envisage the future Internet as a loosely interconnected set of local data centers than a network like today's with routers augmented by limited capacity content stores.Comment: Proceedings of ITC 25 (International Teletraffic Congress), Shanghai, September, 201

Video Evidence That London Infants Can Resettle Themselves Back to Sleep After Waking in the Night, as well as Sleep for Long Periods, by 3 Months of Age

Objective: Most infants become settled at night by 3 months of age, whereas infants not settled by 5 months are likely to have long-term sleep-waking problems. We assessed whether normal infant development in the first 3 months involves increasing sleep-period length or the ability to resettle autonomously after waking in the night. Methods: One hundred one infants were assessed at 5 weeks and 3 months of age using nighttime infrared video recordings and parental questionnaires. Results: The clearest development was in sleep length; 45% of infants slept continuously for 5 hours or more at night at 3 months compared with 10% at 5 weeks. In addition, around a quarter of infants woke and resettled themselves back to sleep in the night at each age. Autonomous resettling at 5 weeks predicted prolonged sleeping at 3 months suggesting it may be a developmental precursor. Infants reported by parents to sleep for a period of 5 hours or more included infants who resettled themselves and those with long sleeps. Three-month olds fed solely breast milk were as likely to self-resettle or have long sleep bouts as infants fed formula or mixed breast and formula milk. Conclusions: Infants are capable of resettling themselves back to sleep in the first 3 months of age; both autonomous resettling and prolonged sleeping are involved in “sleeping through the night” at an early age. Findings indicate the need for physiological studies of how arousal, waking, and resettling develop into sustained sleeping and of how environmental factors support these endogenous and behavioral processes

A versatile and accurate approximation for LRU cache performance

In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che, et al clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law, resulting from the mix of different content types and the filtering effect induced by the lower layers in a cache hierarchy